Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("THEOREM PROVING")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1788

  • Page / 72
Export

Selection :

  • and

BERNOULLI AND THE PAPER DIRIGIBLE.EDGE RD.1976; AMER. J. PHYS.; U.S.A.; DA. 1976; VOL. 44; NO 8; PP. 780-781; BIBL. 1 REF.Article

LOGIC MACHINE ARCHITECTURE: KERNEL FUNCTIONSLUSK EL; MCCUNE WW; OVERBEEK RA et al.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 70-84; BIBL. 8 REF.Conference Paper

ON THE ROLE OF UNIFICATION IN MECHANICAL THEOREM PROVING.SHOSTAK RE.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 7; NO 3; PP. 319-323; BIBL. 8 REF.Article

ON A NEW PROOF OF MOSER'S TWIST MAPPING THEOREM.RUSSMANN H.1976; CELEST. MECH.; NETHERL.; DA. 1976; VOL. 14; NO 1; PP. 19-31; BIBL. 4 REF.; (CONF. MATH. METHODS CELESTIAL MECH. 5. PROC.; OBERWOLFACH; 1975)Conference Paper

COMPARISON OF NATURAL DEDUCTION AND LOCKING RESOLUTION IMPLEMENTATIONSGREENBAUM S; NAGASAKA A; O'RORKE P et al.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 159-171; BIBL. 16 REF.Conference Paper

SUR QUELQUES PROBLEMES DE LA THEORIE DESCRIPTIVE DES ENSEMBLES ET SUR LA RELATION ENTRE LA CONSTRUCTIVITE ET LA DEFINISSABILITEKANOVEJ VG.1980; DOKL. AKAD. NAUK SSSR; ISSN 0002-3264; SUN; DA. 1980; VOL. 253; NO 4; PP. 800-803; BIBL. 14 REF.Article

RESOLUTION PLANS IN THEOREM PROVINGCHANG CL.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 1; PP. 143-148; BIBL. 8 REF.Conference Paper

PROVING PROGRAMS INCORRECT.BRAND D.1976; IN: AUTOM. LANG. PROGRAM. INT. COLLOQ. 3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 201-227; BIBL. 1 P.Conference Paper

AN EVALUATION OF AN IMPLEMENTATION OF QUALIFIED HYPERRESOLUTION.WINKER SK.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 8; PP. 835-843; BIBL. 8 REF.Article

SYSTEMES D'INDEPENDANCE DE TYPE MATROIDEGRITSAK VV.1982; DOKLADY - AKADEMII NAUK UKRAINSKOJ SSR. SERIYA A: FIZIKO-MATEMATICHESKIE I TEKHNICHESKIE NAUKI; ISSN 0201-8446; UKR; DA. 1982; NO 9; PP. 61-62; ABS. ENG; BIBL. 6 REF.Article

AN EXTENSION TO LINEAR RESOLUTION WITH SELECTION FUNCTIONMINKER J; ZANON G.1982; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 4; PP. 191-194; BIBL. 8 REF.Article

THE LOGICAL STATUS OF THERMODYNAMIC PROOFS OF MATHEMATICAL THEOREMSDEAKIN MAB; TROUP GJ.1981; PHYS. LETT. SECT. A; ISSN 0375-9601; NLD; DA. 1981; VOL. 83; NO 6; PP. 239-240; BIBL. 8 REF.Article

TRANSFORMING MATINGS INTO NATURAL DEDUCTION PROOFSANDREWS PB.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 87; PP. 281-292; BIBL. 9 REF.Conference Paper

RESOLUTION IN A NEW MODAL LOGICSHIMURA M.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 2; PP. 809-814; BIBL. 9 REF.Conference Paper

A PRACTICAL DECISION PROCEDURE FOR ARITHMETIC WITH FUNCTION SYMBOLSSHOSTAK RE.1979; J. ANN. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 2; PP. 351-360; BIBL. 17 REF.Article

PRINCIPE DE COMPARAISON POUR L'ETABLISSEMENT DES THEOREMES. IIMATROSOV VM; VASIL'EV SN.1978; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; SUN; DA. 1978; NO 4; PP. 40-49; BIBL. 18 REF.Article

THEOREME ERGODIQUE POUR LES PROCESSUS DE MARKOV. IISHUR MG.1977; TEOR. VEROJAT. PRIMEN.; S.S.S.R.; DA. 1977; VOL. 22; NO 4; PP. 712-728; ABS. ANGL.; BIBL. 10 REF.Article

A NOTE ON SHWIMER'S THEOREM A.DINKELBACH W; ROSENBERG O.1977; MANAG. SCI.; U.S.A.; DA. 1977; VOL. 23; NO 6; PP. 660-661; BIBL. 1 REF.Article

AN INVESTIGATION INTO THE GOALS OF RESEARCH IN AUTOMATIC THEOREM PROVING AS RELATED TO MATHEMATICAL REASONINGBROWN FM.1980; ARTIF. INTELL.; ISSN 0374-2539; NLD; DA. 1980; VOL. 14; NO 3; PP. 221-242; BIBL. 7 REF.Article

DUALITY THEOREMS FOR CERTAIN PROGRAMS INVOLVING MINIMUM OR MAXIMUM OPERATIONSFLACHS J; POLLATSCHEK MA.1979; MATH. PROGRAMMG; NLD; DA. 1979; VOL. 16; NO 3; PP. 348-370; BIBL. 6 REF.Article

EXPONENTIAL IMPROVEMENT OF EFFICIENT BACKTRACKING: A STRATEGY FOR PLAN-BASED DEDUCTIONPIETRZYKOWSKI T; MATWIN S.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 223-239; BIBL. 15 REF.Conference Paper

THEOREM PROVING VIA GENERAL MATINGSANDREWS PB.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 2; PP. 193-214; BIBL. 31 REF.Article

GEOM: A PROLOG GEOMETRY THEOREM PROVERCOELHO H; MONIZ PEREIRA L.1979; LAB. NACION. ENGRIA CIV., MEM.; PRT; DA. 1979; NO 525; 70 P.; ABS. ENG; BIBL. 14 REF.Serial Issue

THEOREM PROVING BY COVERING EXPRESSIONSHENSCHEN LJ.1979; J. ASS. COMPUTG. MACHIN.; USA; DA. 1979; VOL. 26; NO 3; PP. 385-400; BIBL. 14 REF.Article

THEOREME RELATIF AU CARACTERE INDEMONTRABLE DES BORNES INFERIEURES TEMPORELLES POUR QUELQUES CLASSES DE FONCTIONSMAKAROV II.1979; VEROJATN. METODY KIBERN.; SUN; DA. 1979; NO 15; PP. 48-50; BIBL. 1 REF.Article

  • Page / 72